Frobenius Allowable Gaps of Generalized Numerical Semigroups
نویسندگان
چکیده
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ for which the complement $\mathbb{N}^d\setminus S$ finite. The points in are called gaps. gap $F$ considered Frobenius allowable if there some relaxed monomial ordering on with respect to largest gap. We characterize gaps semigroup. that has only one maximal under natural partial show semigroups precisely those whose does not depend ordering. estimate number given $F=(F^{(1)},\dots,F^{(d)})\in\mathbb{N}^d$ and it close $\sqrt{3}^{(F^{(1)}+1)\cdots (F^{(d)}+1)}$ large $d$. define notions quasi-irreducibility quasi-symmetry semigroups. While case $d=1$ these coincide irreducibility symmetry, they distinct higher dimensions.
منابع مشابه
Frobenius numbers of generalized Fibonacci semigroups
The numerical semigroup generated by relatively prime positive integers a1, . . . , an is the set S of all linear combinations of a1, . . . , an with nonnegative integral coefficients. The largest integer which is not an element of S is called the Frobenius number of S. Recently, J. M. Maŕın, J. L. Ramı́rez Alfonśın, and M. P. Revuelta determined the Frobenius number of a Fibonacci semigroup, th...
متن کاملThe Frobenius problem for numerical semigroups
In this paper, we characterize those numerical semigroups containing 〈n1, n2〉. From this characterization, we give formulas for the genus and the Frobenius number of a numerical semigroup. These results can be used to give a method for computing the genus and the Frobenius number of a numerical semigroup with embedding dimension three in terms of its minimal system of generators.
متن کاملInvariants of Generalized Arithmetic Numerical Semigroups
A generalized arithemtic numerical monoid is of the form S = 〈a, ah+d, ah+2d, . . . , ah+ xd〉 where the gcd(a, d) = 1 and a > x. Much is known for the arithmetic numerical monoid, when h = 1, due to known information for that specific monoid’s length set. Therefore, this paper will explore various invariants of the generalized arithmetic numerical monoid.
متن کاملCounting numerical semigroups by genus and even gaps
We present an approach to count numerical semigroups of a given genus by using even gaps. Our method is motivated by the interplay between double covering of curves and γ-hyperelliptic semigroups [15], [12], [28], [18], [17].
متن کاملOn Numerical Semigroups Generated by Generalized Arithmetic Sequences
Given a numerical semigroup S, let M(S) = S \{0} and (lM(S)− lM(S)) = {x ∈ N0 : x + lM(S) ⊆ lM(S)}. Define associated numerical semigroups B(S) := (M(S)−M(S)) and L(S) := ∪l=1(lM(S)− lM(S)). Set B0(S) = S, and for i ≥ 1, define Bi(S) := B(Bi−1(S)). Similarly, set L0(S) = S, and for i ≥ 1, define Li(S) := L(Li−1(S)). These constructions define two finite ascending chains of numerical semigroups ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10748